A Novel Generalized Group-Sparse Mixture Adaptive Filtering Algorithm
نویسندگان
چکیده
منابع مشابه
Partial-Update L∞-Norm Adaptive Filtering Algorithm with Sparse Updates
This paper provides a partial-update normalized sign least-mean square (NSLMS) algorithm with sparse updates. The proposed algorithm reduces the computational complexity compared with the conventional L∞-norm adaptive filtering algorithms by decreasing the frequency of updating the filter coefficients and updating only a part of the filter coefficients. And we develop a mean square analysis to ...
متن کاملA novel multirate adaptive FIR filtering algorithm and structure
A new class of FIR ltering algorithms and VLSI architectures based on the multirate approach were recently proposed. They not only reduce the computational complexity in FIR ltering, but also retain attractive implementationrelated properties such as regularity and multiply-and-accumulate (MAC) structure. In addition, the multirate feature can be applied to low-power/high-speed VLSI implementat...
متن کاملA kernel-based RLS algorithm for nonlinear adaptive filtering using sparse approximation theory
In the last ten years, there has been an explosion of activity in the field of learning algorithms utilizing reproducing kernels, most notably for classification and regression. A common characteristic in kernelbased methods is that they deal with models whose order equals the number of input data, making them unsuitable for online applications. In this paper, we investigate a new kernel-based ...
متن کاملA mixture-of-experts framework for adaptive Kalman filtering
This paper proposes a modular and flexible approach to adaptive Kalman filtering using the framework of a mixture-of-experts regulated by a gating network. Each expert is a Kalman filter modeled with a different realization of the unknown system parameters such as process and measurement noise. The gating network performs on-line adaptation of the weights given to individual filter estimates ba...
متن کاملA High Performance Blind Adaptive Filtering Algorithm
Recently a dithered signed-error constant modulus algorithm (DSE-CMA) has been proposed for the purpose of low complexity implementation of constant modulus algorithm (CMA), which is widely used for blind adaptive filtering due to its LMS-like desirable robustness properties. Despite the fact that this algorithm has robustness properties closely resembling those of CMA, it is very slow in conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11050697